Rational Universal Benevolence: Simpler, Safer, and Wiser Than "Friendly AI"
نویسنده
چکیده
Insanity is doing the same thing over and over and expecting a different result. “Friendly AI” (FAI) meets these criteria on four separate counts by expecting a good result after: 1) it not only puts all of humanity’s eggs into one basket but relies upon a totally new and untested basket, 2) it allows fear to dictate our lives, 3) it divides the universe into us vs. them, and finally 4) it rejects the value of diversity. In addition, FAI goal initialization relies on being able to correctly calculate a “Coherent Extrapolated Volition of Humanity” (CEV) via some as-yet-undiscovered algorithm. Rational Universal Benevolence (RUB) is based upon established game theory and evolutionary ethics and is simple, safe, stable, self-correcting, and sensitive to current human thinking, intuitions, and feelings. Which strategy would you prefer to rest the fate of humanity upon?
منابع مشابه
Towards a Universal Theory of Artiicial Intelligence Based on Algorithmic Probability and Sequential Decision Theory
Decision theory formally solves the problem of rational agents in uncertain worlds if the true environmental probability distribution is known. Solomonoo's theory of universal induction formally solves the problem of sequence prediction for unknown distribution. We unify both theories and give strong arguments that the resulting universal AI model behaves optimal in any computable environment. ...
متن کاملBenevolence, Trust and Autonomy
In this paper we will discuss tradeoffs between trust and autonomy. We show that benevolence play a central role in connecting these two social notions. We will show empirical results that illustrate the affinity between trust and autonomy.
متن کاملThe Off-Switch Game
It is clear that one of the primary tools we can use to mitigate the potential risk from a misbehaving AI system is the ability to turn the system off. As the capabilities of AI systems improve, it is important to ensure that such systems do not adopt subgoals that prevent a human from switching them off. This is a challenge because many formulations of rational agents create strong incentives ...
متن کاملRATIONAL BENEVOLENCE IN SMALL COMMITTEES by Derek
We consider a pie-splitting game involving three committee members. In response to the large literature on sequential procedures in this type of game, we propose an institution that is inspired by auction theory. The (sealed) bids of the players are proposals for a distribution of the pie and are given simultaneously. If any of the bids is preferred to all others in a pairwise comparison (i.e. ...
متن کاملA General Theory of Computational Scalability Based on Rational Functions
The universal scalability law (USL) of computational capacity is a rational function Cp = P (p)/Q(p) with P (p) a linear polynomial and Q(p) a second-degree polynomial in the number of physical processors p, that has been long used for statistical modeling and prediction of computer system performance. We prove that Cp is equivalent to the synchronous throughput bound for a machine-repairman wi...
متن کامل